Design for sieving
نویسندگان
چکیده
منابع مشابه
Block Sieving Algorithms Block Sieving Algorithms
Quite similiar to the Sieve of Erastosthenes, the best-known general algorithms for fac-toring large numbers today are memory-bounded processes. We develop three variations of the sieving phase and discuss them in detail. The fastest modiication is tailored to RISC processors and therefore especially suited for modern workstations and massively parallel supercomputers. For a 116 decimal digit c...
متن کاملCyclic Sieving for Cyclic Codes
These are notes on a preliminary follow-up to a question of Jim Propp, about cyclic sieving of cyclic codes. We show that two of the Mahonian polynomials are cyclic sieving polynomials for certain Dual Hamming Codes: X and X inv for q = 2, 3 and q = 2, respectively.
متن کاملHemofiltration, adsorption, sieving and the challenge of sepsis therapy design
Circulating inflammatory mediators spilling into the circulation from sites of active inflammation are considered the source of remote tissue injury and associated organ dysfunction in sepsis. Hemofiltration has been proposed as a therapy for sepsis based on its ability to remove circulating inflammatory mediators by sieving or by adsorption, or both. Designing devices and methods for sepsis th...
متن کاملSieving for Closest Lattice Vectors (with Preprocessing)
Lattice-based cryptography has recently emerged as a prime candidate for efficient and secure post-quantum cryptography. The two main hard problems underlying its security are the shortest vector problem (SVP) and the closest vector problem (CVP). Various algorithms have been studied for solving these problems, and for SVP, lattice sieving currently dominates in terms of the asymptotic time com...
متن کاملSieving for Shortest Vectors in Ideal Lattices
Lattice based cryptography is gaining more and more importance in the cryptographic community. It is a common approach to use a special class of lattices, so-called ideal lattices, as the basis of lattice based crypto systems. This speeds up computations and saves storage space for cryptographic keys. The most important underlying hard problem is the shortest vector problem. So far there is no ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1996
ISSN: 0028-0836,1476-4687
DOI: 10.1038/382583a0